Modular Proof Systems for Partial Functions with Weak Equality
Identifieur interne : 006B66 ( Main/Exploration ); précédent : 006B65; suivant : 006B67Modular Proof Systems for Partial Functions with Weak Equality
Auteurs : Harald Ganzinger [Allemagne] ; Viorica Sofronie-Stokkermans [Allemagne] ; Uwe Waldmann [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pure, only involving clauses over the alphabet of either one, but not both, of the theories. The calculus is shown to be complete provided that functions that are not in the intersection of the component signatures are declared as partial. This result also means that if the unsatisfiability of a goal modulo the combined theory does not depend on the totality of the functions in the extensions, the inconsistency will be effectively found. Moreover, we consider a constraint superposition calculus for the case of hierarchical theories and show that it has a related modularity property. Finally we identify cases where the partial models can always be made total so that modular superposition is also complete with respect to the standard (total function) semantics of the theories.
Url:
DOI: 10.1007/978-3-540-25984-8_10
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001A09
- to stream Istex, to step Curation: 001989
- to stream Istex, to step Checkpoint: 001775
- to stream Main, to step Merge: 006E70
- to stream Main, to step Curation: 006B66
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Modular Proof Systems for Partial Functions with Weak Equality</title><author><name sortKey="Ganzinger, Harald" sort="Ganzinger, Harald" uniqKey="Ganzinger H" first="Harald" last="Ganzinger">Harald Ganzinger</name></author><author><name sortKey="Sofronie Stokkermans, Viorica" sort="Sofronie Stokkermans, Viorica" uniqKey="Sofronie Stokkermans V" first="Viorica" last="Sofronie-Stokkermans">Viorica Sofronie-Stokkermans</name></author><author><name sortKey="Waldmann, Uwe" sort="Waldmann, Uwe" uniqKey="Waldmann U" first="Uwe" last="Waldmann">Uwe Waldmann</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:6FF6EEB7E7C6CAB8AA0337763A8DECDC0E940E55</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-25984-8_10</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-2PK99VBZ-W/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001A09</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001A09</idno><idno type="wicri:Area/Istex/Curation">001989</idno><idno type="wicri:Area/Istex/Checkpoint">001775</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001775</idno><idno type="wicri:doubleKey">0302-9743:2004:Ganzinger H:modular:proof:systems</idno><idno type="wicri:Area/Main/Merge">006E70</idno><idno type="wicri:Area/Main/Curation">006B66</idno><idno type="wicri:Area/Main/Exploration">006B66</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Modular Proof Systems for Partial Functions with Weak Equality</title><author><name sortKey="Ganzinger, Harald" sort="Ganzinger, Harald" uniqKey="Ganzinger H" first="Harald" last="Ganzinger">Harald Ganzinger</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Sofronie Stokkermans, Viorica" sort="Sofronie Stokkermans, Viorica" uniqKey="Sofronie Stokkermans V" first="Viorica" last="Sofronie-Stokkermans">Viorica Sofronie-Stokkermans</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Waldmann, Uwe" sort="Waldmann, Uwe" uniqKey="Waldmann U" first="Uwe" last="Waldmann">Uwe Waldmann</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pure, only involving clauses over the alphabet of either one, but not both, of the theories. The calculus is shown to be complete provided that functions that are not in the intersection of the component signatures are declared as partial. This result also means that if the unsatisfiability of a goal modulo the combined theory does not depend on the totality of the functions in the extensions, the inconsistency will be effectively found. Moreover, we consider a constraint superposition calculus for the case of hierarchical theories and show that it has a related modularity property. Finally we identify cases where the partial models can always be made total so that modular superposition is also complete with respect to the standard (total function) semantics of the theories.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Sarre (Land)</li></region><settlement><li>Sarrebruck</li></settlement></list><tree><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Ganzinger, Harald" sort="Ganzinger, Harald" uniqKey="Ganzinger H" first="Harald" last="Ganzinger">Harald Ganzinger</name></region><name sortKey="Ganzinger, Harald" sort="Ganzinger, Harald" uniqKey="Ganzinger H" first="Harald" last="Ganzinger">Harald Ganzinger</name><name sortKey="Sofronie Stokkermans, Viorica" sort="Sofronie Stokkermans, Viorica" uniqKey="Sofronie Stokkermans V" first="Viorica" last="Sofronie-Stokkermans">Viorica Sofronie-Stokkermans</name><name sortKey="Sofronie Stokkermans, Viorica" sort="Sofronie Stokkermans, Viorica" uniqKey="Sofronie Stokkermans V" first="Viorica" last="Sofronie-Stokkermans">Viorica Sofronie-Stokkermans</name><name sortKey="Waldmann, Uwe" sort="Waldmann, Uwe" uniqKey="Waldmann U" first="Uwe" last="Waldmann">Uwe Waldmann</name><name sortKey="Waldmann, Uwe" sort="Waldmann, Uwe" uniqKey="Waldmann U" first="Uwe" last="Waldmann">Uwe Waldmann</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006B66 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006B66 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:6FF6EEB7E7C6CAB8AA0337763A8DECDC0E940E55
|texte= Modular Proof Systems for Partial Functions with Weak Equality
}}
| This area was generated with Dilib version V0.6.33. |  |